Kripke models for subtheories of CZF
نویسنده
چکیده
In this paper a method to construct Kripke models for subtheories of constructive set theory is introduced that uses constructions from classical model theory such as constructible sets and generic extensions. Under the main construction all axioms except the collection axioms can be shown to hold in the constructed Kripke model. It is shown that by carefully choosing the classical models various instances of the collection axioms, such as exponentiation, can be forced to hold as well. The paper does not contain any deep results. It consists of first observations on the subject, and is meant to introduce some notions that could serve as a foundation for further research.
منابع مشابه
Constructive Set Theory and Brouwerian Principles
The paper furnishes realizability models of constructive Zermelo-Fraenkel set theory, CZF, which also validate Brouwerian principles such as the axiom of continuous choice (CC), the fan theorem (FT), and bar induction (BI), and thereby determines the proof-theoretic strength of CZF augmented by these principles. The upshot is that CZF+CC+FT possesses the same strength as CZF, or more precisely,...
متن کاملTruth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملThe Relation Reflection Scheme
In this paper we introduce a new axiom scheme, the Relation Reflection Scheme (RRS), for constructive set theory. Constructive set theory is an extensional set theoretical setting for constructive mathematics. A formal system for constructive set theory was first introduced by Myhill in [8]. In [1, 2, 3] I introduced a formal system CZF that is closely related to Myhill’s formal system and gave...
متن کاملCategorical semantics of constructive set theory
ion: If φ(x, y1, . . . , yn) is a bounded formula and a is a set, then so is {{x ∈ a : φ(x, y1, . . . , yn} : y1, . . . , yn ∈ x}. 2. Add bounded dependent choice, which is dependent choice for bounded formulas. 3. Weaking Full Induction to Induction: Induction: The set ω satisfies the induction axiom: if x is any set such that 0 ∈ x holds and n ∈ x implies n+ 1 ∈ x, then ω ⊆ x. It is last chan...
متن کاملCZF has the Disjunction and Numerical Existence Property
This paper proves that the disjunction property, the numerical existence property and Church’s rule hold true for Constructive Zermelo-Fraenkel Set Theory, CZF, and also for the theory CZF augmented by the Regular Extension Axiom. As to the proof technique, it features a self-validating semantics for CZF that combines extensional Kleene realizability and truth. MSC:03F50, 03F35
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Arch. Math. Log.
دوره 49 شماره
صفحات -
تاریخ انتشار 2010